Robust Forwarding in Structured Peer-to-Peer Overlay Networks
نویسندگان
چکیده
Motivation and Related Work ‰Vulnerability of the overlay networks: Because of openness to participating in message forwarding and a lack of facilities ensuring the forwarding integrity, adversaries can easily disrupt the normal lookup message forwarding. ‰Severe damage caused by forwarding attacks: Even a small percentage of faulty nodes that inject forwarding faults can seriously degrade the performance of a P2P network. In the simulation study of Pastry, the probability of successful delivery of a lookup message is dropped to 65% in the presence of 10% faulty nodes in a network of 100,000 nodes [1]. ‰Lack of solutions with low communication complexity: Existing approaches mainly focus on providing resilience by forwarding each request via multiple paths concurrently. These approaches increase reliable at the cost of high communication complexity. ‰Extension of robust forwarding protocols to the overlay networks: Existing robust forwarding protocols (reference in [2]) rely on source routing and continuous end-to-end communications, which are not suitable for the overlay networks.
منابع مشابه
A Framework for Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks have recently emerged as good candidate infrastructure for building novel large-scale and robust Internet applications in which participating peers share computing resources as equals. In the past three year, various structured peer-to-peer overlay networks have been proposed, and probably more are to come. We present a framework for understanding, analy...
متن کاملRobust Random Number Generation for Peer-to-Peer Systems
We consider the problem of designing an efficient and robust distributed random number generator for peer-to-peer systems that is easy to implement and works even if all communication channels are public. A robust random number generator is crucial for avoiding adversarial join-leave attacks on peer-to-peer overlay networks. We show that our new generator together with a light-weight rule recen...
متن کاملHierarchical Structured Peer-to-Peer Networks
Structured peer-to-peer systems or distributed hash tables (DHT) are self-organizing distributed systems designed to support efficient and scalable lookups with dynamic network topology changes. Nodes are organized as structured overlay networks, and data is mapped to nodes in the overlap network based on their identifier. There are two main types of structured peer-to-peer architectures: flat ...
متن کاملImproving Peer to Peer Search With Multi-Tier Capability-Aware Overlay Topologies
The P2P model has many potential advantages (e.g., large scale, fault-tolerance, low cost of administration and maintenance) due to the design flexibility of overlay networks and the decentralized management of cooperative sharing of information and resources. However, the mismatch between the randomly constructed overlay network topology (combined with its broadcaststyle message forwarding inf...
متن کاملTaxonomy of Structured P2P Overlay Networks Security Attacks
The survey and classification of the different security attacks in structured peer-to-peer (P2P) overlay networks can be useful to computer system designers, programmers, administrators, and users. In this paper, we attempt to provide a taxonomy of structured P2P overlay networks security attacks. We have specially focused on the way these attacks can arise at each level of the network. Moreove...
متن کامل